Strong Convergence for URN Models with Reducible Replacement Policy

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong convergence for urn models with reducible replacement policy

A multitype urn scheme with random replacements is considered. Each time a ball is picked, another ball is added, and its type is chosen according to the transition probabilities of a reducible Markov chain. The vector of frequencies is shown to converge almost surely to a random element of the set of stationary measures of the Markov chain. Its probability distribution is characterized as the ...

متن کامل

Multicolor urn models with reducible replacement matrices

Consider the multicolored urn model where after every draw, balls of the different colors are added to the urn in proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not irreducible. For three and four color urns, we derive the asymptotic behavior of linear combinations of number of balls. In particular, we show that certain li...

متن کامل

Pólya Urn Models under General Replacement Schemes

In this paper, we consider a Pólya urn model containing balls of m different labels under a general replacement scheme, which is characterized by an m×m addition matrix of integers without constraints on the values of these m integers other than non-negativity. This urn model includes some important urn models treated before. By a method based on the probability generating functions, we conside...

متن کامل

P´olya-Type Urn Models with Multiple Drawings

We investigate the distribution, mean value, variance and some limiting properties of an urn model of white and red balls under random multiple drawing (either with or without replacement) when the number of white and red balls added follows a schedule that depends on the number of white balls chosen in each drawing.

متن کامل

On Sampling without Replacement and Ok-corral Urn Models

In this work we discuss two urn models with general weight sequences (A,B) associated to them, A = (αn)n∈N andB = (βm)m∈N, generalizing two well known Pólya-Eggenberger urn models, namely the so-called sampling without replacement urn model and the OK Corral urn model. We derive simple explicit expressions for the distribution of the number of white balls, when all black have been drawn, and ob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Probability

سال: 2007

ISSN: 0021-9002,1475-6072

DOI: 10.1017/s0021900200003338